Improved Distance Oracles and Spanners for Vertex-Labeled Graphs

Consider an undirected weighted graph G = (V,E) with |V | = n and |E| = m, where each vertex v ∈ V is assigned a label from a set of labels L = {λ1, ..., λl}. We show how to construct a compact distance oracle that can answer queries of the form: “what is the distance from v to the closest λ-labeled node” for a given node v ∈ V and label λ ∈ L. This problem was introduced by Hermelin, Levy, Weimann and Yuster [ICALP 2011] where they present several results for this problem. In the first result, they show how to construct a vertex-label distance oracle of expected size O(kn) with stretch (4k− 5) and query time O(k). In a second result, they show how to reduce the size of the data structure to O(knl) at the expense of a huge stretch, the stretch of this construction grows exponentially in k, (2−1). In the third result they present a dynamic vertex-label distance oracle that is capable of handling label changes in a sub-linear time. The stretch of this construction is also exponential in k, (2 · 3 + 1). We manage to significantly improve the stretch of their constructions, reducing the dependence on k from exponential to polynomial (4k − 5), without requiring any tradeoff regarding any of the other variables. In addition, we introduce the notion of vertex-label spanners: subgraphs that preserve distances between every node v ∈ V and label λ ∈ L. We present an efficient construction for vertex-label spanners with stretch-size tradeoff close to optimal.